Efficient Multicast in Wormhole-Routed 2D Mesh/Torus Multicomputers: A Network-Partitioning Approach
نویسندگان
چکیده
In this paper, a network-partitioning scheme for multicasting on wormhole-routed networks is proposed. To multicast a message, the scheme works in three phases. First, a number of data-distributing networks (DDNs), which can work independently, are constructed. Then the message is evenly divided into sub-messages each being sent to a representative node in one DDN. Second, the sub-messages are multicast on the DDNs concurrently. Finally, a number of data-collecting networks (DCNs), which can work independently too, are constructed. Then concurrently on each DCN the sub-messages are re-collected and combined into the original message. One interesting issue is on the definition of independent DDNs and DCNs, in the sense of wormhole routing. We show how to apply this scheme to 2D tori and meshes. Thorough analyses and experiments based on different system parameters and configurations are conducted. The results do confirm the advantage of our scheme, under various system parameters and conditions, over other existing multicasting algorithms.
منابع مشابه
Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a re...
متن کاملAn Efficient Multicast Wormhole Algorithm for Balancing Traffic in 2D Torus Multicomputers
A multicast communication is a significant operation in multicomputers and can be used to support several other collective communication operations. 2D torus network has become increasingly important to multicomputer system design because of its many features. This paper presents an efficient multicast wormhole deadlock-free algorithm that Balance Traffic Load on 2D torus network; hence the nam...
متن کاملBalancing Traffic Load for Multi-Node Multicast in a Wormhole 2D Torus/Mesh
This paper considers the multi-node multicast problem in a wormhole-routed 2-D torus/mesh, where an arbitrary number of source nodes each intends to multicast a message to an arbitrary set of destinations. To resolve the contention and the congestion problems, we propose to partition the network into subnetworks to distribute, and thus balance, the traffic load among all network links. Several ...
متن کاملAdaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کامل